TSTP Solution File: CSR138^1 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : CSR138^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 30 21:07:11 EDT 2023

% Result   : Theorem 0.17s 0.48s
% Output   : Proof 0.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : CSR138^1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.11  % Command    : do_cvc5 %s %d
% 0.11/0.32  % Computer : n018.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Aug 28 13:11:16 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.44  %----Proving TH0
% 0.17/0.45  %------------------------------------------------------------------------------
% 0.17/0.45  % File     : CSR138^1 : TPTP v8.1.2. Released v4.1.0.
% 0.17/0.45  % Domain   : Commonsense Reasoning
% 0.17/0.45  % Problem  : Feelings from people to Bill and Anna
% 0.17/0.45  % Version  : Especial.
% 0.17/0.45  % English  : Do there exist relations ?R and ?Q so that ?R holds between a 
% 0.17/0.45  %            person ?Y and Bill and ?Q between ?Y and Anna. 
% 0.17/0.45  
% 0.17/0.45  % Refs     : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.17/0.45  % Source   : [Ben10]
% 0.17/0.45  % Names    : rv_4.tq_SUMO_local [Ben10]
% 0.17/0.45  
% 0.17/0.45  % Status   : Theorem
% 0.17/0.45  % Rating   : 0.31 v8.1.0, 0.27 v7.5.0, 0.29 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.25 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v6.1.0, 0.57 v6.0.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v5.1.0, 0.40 v5.0.0, 0.20 v4.1.0
% 0.17/0.45  % Syntax   : Number of formulae    :   19 (   7 unt;   9 typ;   0 def)
% 0.17/0.45  %            Number of atoms       :   17 (   2 equ;   4 cnn)
% 0.17/0.45  %            Maximal formula atoms :    4 (   1 avg)
% 0.17/0.45  %            Number of connectives :   33 (   4   ~;   0   |;   3   &;  26   @)
% 0.17/0.45  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.17/0.45  %            Maximal formula depth :    8 (   4 avg)
% 0.17/0.45  %            Number of types       :    3 (   1 usr)
% 0.17/0.45  %            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
% 0.17/0.45  %            Number of symbols     :   11 (   8 usr;   8 con; 0-2 aty)
% 0.17/0.45  %            Number of variables   :   11 (   4   ^;   0   !;   7   ?;  11   :)
% 0.17/0.45  % SPC      : TH0_THM_EQU_NAR
% 0.17/0.45  
% 0.17/0.45  % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.17/0.45  %            Initally the problem has been hand generated in KIF syntax in
% 0.17/0.45  %            SigmaKEE and then automatically translated by Benzmueller's
% 0.17/0.45  %            KIF2TH0 translator into THF syntax.
% 0.17/0.45  %          : The translation has been applied in two modes: local and SInE.
% 0.17/0.45  %            The local mode only translates the local assumptions and the
% 0.17/0.45  %            query. The SInE mode additionally translates the SInE-extract
% 0.17/0.45  %            of the loaded knowledge base (usually SUMO).
% 0.17/0.45  %          : The examples are selected to illustrate the benefits of
% 0.17/0.45  %            higher-order reasoning in ontology reasoning.
% 0.17/0.45  %------------------------------------------------------------------------------
% 0.17/0.45  %----The extracted signature
% 0.17/0.45  thf(numbers,type,
% 0.17/0.45      num: $tType ).
% 0.17/0.45  
% 0.17/0.45  thf(lAnna_THFTYPE_i,type,
% 0.17/0.45      lAnna_THFTYPE_i: $i ).
% 0.17/0.45  
% 0.17/0.45  thf(lBen_THFTYPE_i,type,
% 0.17/0.45      lBen_THFTYPE_i: $i ).
% 0.17/0.45  
% 0.17/0.45  thf(lBill_THFTYPE_i,type,
% 0.17/0.45      lBill_THFTYPE_i: $i ).
% 0.17/0.45  
% 0.17/0.45  thf(lBob_THFTYPE_i,type,
% 0.17/0.45      lBob_THFTYPE_i: $i ).
% 0.17/0.45  
% 0.17/0.45  thf(lMary_THFTYPE_i,type,
% 0.17/0.45      lMary_THFTYPE_i: $i ).
% 0.17/0.45  
% 0.17/0.45  thf(lSue_THFTYPE_i,type,
% 0.17/0.45      lSue_THFTYPE_i: $i ).
% 0.17/0.45  
% 0.17/0.45  thf(likes_THFTYPE_IiioI,type,
% 0.17/0.45      likes_THFTYPE_IiioI: $i > $i > $o ).
% 0.17/0.45  
% 0.17/0.45  thf(parent_THFTYPE_IiioI,type,
% 0.17/0.45      parent_THFTYPE_IiioI: $i > $i > $o ).
% 0.17/0.45  
% 0.17/0.45  %----The translated axioms
% 0.17/0.45  thf(ax,axiom,
% 0.17/0.45      likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.17/0.45  
% 0.17/0.45  thf(ax_001,axiom,
% 0.17/0.45      likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.17/0.45  
% 0.17/0.45  thf(ax_002,axiom,
% 0.17/0.45      ? [X: $i,Y: $i] : ( (~) @ ( parent_THFTYPE_IiioI @ X @ Y ) ) ).
% 0.17/0.45  
% 0.17/0.45  thf(ax_003,axiom,
% 0.17/0.45      ? [X: $i,Y: $i] : ( (~) @ ( likes_THFTYPE_IiioI @ X @ Y ) ) ).
% 0.17/0.45  
% 0.17/0.45  thf(ax_004,axiom,
% 0.17/0.45      parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i ).
% 0.17/0.45  
% 0.17/0.45  thf(ax_005,axiom,
% 0.17/0.45      parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i ).
% 0.17/0.45  
% 0.17/0.45  thf(ax_006,axiom,
% 0.17/0.45      likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ).
% 0.17/0.45  
% 0.17/0.45  thf(ax_007,axiom,
% 0.17/0.45      parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ).
% 0.17/0.45  
% 0.17/0.45  thf(ax_008,axiom,
% 0.17/0.45      parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i ).
% 0.17/0.45  
% 0.17/0.45  %----The translated conjecture
% 0.17/0.45  thf(con,conjecture,
% 0.17/0.45      ? [Q: $i > $i > $o,R: $i > $i > $o,Y: $i] :
% 0.17/0.45        ( ( R @ Y @ lBill_THFTYPE_i )
% 0.17/0.45        & ( Q @ Y @ lAnna_THFTYPE_i )
% 0.17/0.45        & ( (~)
% 0.17/0.45          @ ( R
% 0.17/0.45            = ( ^ [Z: $i,W: $i] : $true ) ) )
% 0.17/0.45        & ( (~)
% 0.17/0.45          @ ( Q
% 0.17/0.45            = ( ^ [Z: $i,W: $i] : $true ) ) ) ) ).
% 0.17/0.45  
% 0.17/0.45  %------------------------------------------------------------------------------
% 0.17/0.45  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.JdgNWVVDXg/cvc5---1.0.5_19016.p...
% 0.17/0.45  (declare-sort $$unsorted 0)
% 0.17/0.45  (declare-sort tptp.num 0)
% 0.17/0.48  (declare-fun tptp.lAnna_THFTYPE_i () $$unsorted)
% 0.17/0.48  (declare-fun tptp.lBen_THFTYPE_i () $$unsorted)
% 0.17/0.48  (declare-fun tptp.lBill_THFTYPE_i () $$unsorted)
% 0.17/0.48  (declare-fun tptp.lBob_THFTYPE_i () $$unsorted)
% 0.17/0.48  (declare-fun tptp.lMary_THFTYPE_i () $$unsorted)
% 0.17/0.48  (declare-fun tptp.lSue_THFTYPE_i () $$unsorted)
% 0.17/0.48  (declare-fun tptp.likes_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.17/0.48  (declare-fun tptp.parent_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.17/0.48  (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.17/0.48  (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.17/0.48  (assert (exists ((X $$unsorted) (Y $$unsorted)) (not (@ (@ tptp.parent_THFTYPE_IiioI X) Y))))
% 0.17/0.48  (assert (exists ((X $$unsorted) (Y $$unsorted)) (not (@ (@ tptp.likes_THFTYPE_IiioI X) Y))))
% 0.17/0.48  (assert (@ (@ tptp.parent_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBen_THFTYPE_i))
% 0.17/0.48  (assert (@ (@ tptp.parent_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBen_THFTYPE_i))
% 0.17/0.48  (assert (@ (@ tptp.likes_THFTYPE_IiioI tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i))
% 0.17/0.48  (assert (@ (@ tptp.parent_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lAnna_THFTYPE_i))
% 0.17/0.48  (assert (@ (@ tptp.parent_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lAnna_THFTYPE_i))
% 0.17/0.48  (assert (not (exists ((Q (-> $$unsorted $$unsorted Bool)) (R (-> $$unsorted $$unsorted Bool)) (Y $$unsorted)) (and (@ (@ R Y) tptp.lBill_THFTYPE_i) (@ (@ Q Y) tptp.lAnna_THFTYPE_i) (not (= R (lambda ((Z $$unsorted) (W $$unsorted)) true))) (not (= Q (lambda ((Z $$unsorted) (W $$unsorted)) true)))))))
% 0.17/0.48  (set-info :filename cvc5---1.0.5_19016)
% 0.17/0.48  (check-sat-assuming ( true ))
% 0.17/0.48  ------- get file name : TPTP file name is CSR138^1
% 0.17/0.48  ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_19016.smt2...
% 0.17/0.48  --- Run --ho-elim --full-saturate-quant at 10...
% 0.17/0.48  % SZS status Theorem for CSR138^1
% 0.17/0.48  % SZS output start Proof for CSR138^1
% 0.17/0.48  (
% 0.17/0.48  (let ((_let_1 (not (exists ((Q (-> $$unsorted $$unsorted Bool)) (R (-> $$unsorted $$unsorted Bool)) (Y $$unsorted)) (and (@ (@ R Y) tptp.lBill_THFTYPE_i) (@ (@ Q Y) tptp.lAnna_THFTYPE_i) (not (= R (lambda ((Z $$unsorted) (W $$unsorted)) true))) (not (= Q (lambda ((Z $$unsorted) (W $$unsorted)) true)))))))) (let ((_let_2 (@ tptp.parent_THFTYPE_IiioI tptp.lMary_THFTYPE_i))) (let ((_let_3 (@ tptp.parent_THFTYPE_IiioI tptp.lSue_THFTYPE_i))) (let ((_let_4 (@ _let_3 tptp.lAnna_THFTYPE_i))) (let ((_let_5 (exists ((X $$unsorted) (Y $$unsorted)) (not (@ (@ tptp.likes_THFTYPE_IiioI X) Y))))) (let ((_let_6 (exists ((X $$unsorted) (Y $$unsorted)) (not (@ (@ tptp.parent_THFTYPE_IiioI X) Y))))) (let ((_let_7 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_8 (ho_5 (ho_4 k_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_10) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_11))) (let ((_let_9 (= k_3 k_6))) (let ((_let_10 (ho_5 (ho_4 k_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_10) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_11))) (let ((_let_11 (forall ((X $$unsorted) (Y $$unsorted)) (ho_5 (ho_4 k_6 X) Y)))) (let ((_let_12 (not _let_8))) (let ((_let_13 (not _let_11))) (let ((_let_14 (EQ_RESOLVE (ASSUME :args (_let_5)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((X $$unsorted) (Y $$unsorted)) (@ (@ tptp.likes_THFTYPE_IiioI X) Y))) _let_13))))))) (let ((_let_15 (or))) (let ((_let_16 (_let_12))) (let ((_let_17 (= k_3 k_7))) (let ((_let_18 (ho_5 (ho_4 k_7 tptp.lSue_THFTYPE_i) tptp.lAnna_THFTYPE_i))) (let ((_let_19 (not _let_18))) (let ((_let_20 (ho_5 (ho_4 k_6 tptp.lSue_THFTYPE_i) tptp.lBill_THFTYPE_i))) (let ((_let_21 (not _let_20))) (let ((_let_22 (or _let_21 _let_19 _let_9 _let_17))) (let ((_let_23 (forall ((BOUND_VARIABLE_727 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_729 |u_(-> $$unsorted $$unsorted Bool)|) (Y $$unsorted)) (or (not (ho_5 (ho_4 BOUND_VARIABLE_729 Y) tptp.lBill_THFTYPE_i)) (not (ho_5 (ho_4 BOUND_VARIABLE_727 Y) tptp.lAnna_THFTYPE_i)) (= k_3 BOUND_VARIABLE_729) (= k_3 BOUND_VARIABLE_727))))) (let ((_let_24 (forall ((Q (-> $$unsorted $$unsorted Bool)) (R (-> $$unsorted $$unsorted Bool)) (Y $$unsorted)) (or (not (@ (@ R Y) tptp.lBill_THFTYPE_i)) (not (@ (@ Q Y) tptp.lAnna_THFTYPE_i)) (= R ll_2) (= Q ll_2))))) (let ((_let_25 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((Q (-> $$unsorted $$unsorted Bool)) (R (-> $$unsorted $$unsorted Bool)) (Y $$unsorted)) (or (not (@ (@ R Y) tptp.lBill_THFTYPE_i)) (not (@ (@ Q Y) tptp.lAnna_THFTYPE_i)) (= R (lambda ((BOUND_VARIABLE_664 $$unsorted) (BOUND_VARIABLE_666 $$unsorted)) true)) (= Q (lambda ((BOUND_VARIABLE_664 $$unsorted) (BOUND_VARIABLE_666 $$unsorted)) true)))) _let_24))) (PREPROCESS :args ((= _let_24 _let_23))))))) (let ((_let_26 (ho_5 (ho_4 k_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9))) (let ((_let_27 (ho_5 (ho_4 k_7 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9))) (let ((_let_28 (not _let_17))) (let ((_let_29 (forall ((BOUND_VARIABLE_675 $$unsorted) (BOUND_VARIABLE_676 $$unsorted)) (ho_5 (ho_4 k_3 BOUND_VARIABLE_675) BOUND_VARIABLE_676)))) (let ((_let_30 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_5 v ii) (ite (= i ii) e (ho_5 u ii)))))))))) (let ((_let_31 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_5 x z) (ho_5 y z)))) (= x y))))) (let ((_let_32 (forall ((u |u_(-> $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_4 v ii) (ite (= i ii) e (ho_4 u ii)))))))))) (let ((_let_33 (forall ((x |u_(-> $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_4 x z) (ho_4 y z)))) (= x y))))) (let ((_let_34 (forall ((BOUND_VARIABLE_675 $$unsorted) (BOUND_VARIABLE_676 $$unsorted)) (ll_2 BOUND_VARIABLE_675 BOUND_VARIABLE_676)))) (let ((_let_35 (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (AND_INTRO (ASSUME :args (_let_7)) (PREPROCESS :args (_let_34))) (PREPROCESS :args ((= (and _let_7 _let_34) (and _let_20 _let_29))))) (PREPROCESS :args ((and _let_33 _let_32 _let_31 _let_30)))) :args ((and _let_20 _let_29 _let_33 _let_32 _let_31 _let_30))))) (let ((_let_36 (AND_ELIM _let_35 :args (1)))) (let ((_let_37 (_let_29))) (let ((_let_38 (ASSUME :args _let_37))) (let ((_let_39 (forall ((X $$unsorted) (Y $$unsorted)) (ho_5 (ho_4 k_7 X) Y)))) (let ((_let_40 (not _let_27))) (let ((_let_41 (not _let_39))) (let ((_let_42 (EQ_RESOLVE (ASSUME :args (_let_6)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((X $$unsorted) (Y $$unsorted)) (@ (@ tptp.parent_THFTYPE_IiioI X) Y))) _let_41))))))) (let ((_let_43 (_let_40))) (let ((_let_44 (APPLY_UF ho_5))) (let ((_let_45 (APPLY_UF ho_4))) (let ((_let_46 (ASSUME :args (_let_10)))) (let ((_let_47 (ASSUME :args (_let_9)))) (let ((_let_48 (ASSUME :args _let_16))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_46 _let_47 _let_48) :args (_let_12 _let_9 _let_10)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_48)) (CONG (CONG (SYMM _let_47) (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_10)) :args _let_45) (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_11)) :args _let_44) (TRUE_INTRO _let_46))) :args (_let_10 _let_9 _let_12)) :args ((not (and _let_12 _let_9 _let_10)) SB_LITERAL))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_8))) (REFL :args ((not _let_9))) (REFL :args ((not _let_10))) :args _let_15)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_38 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_10 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_11 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_37)) _let_36 :args (_let_10 false _let_29)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_22)) :args ((or _let_21 _let_19 _let_9 _let_17 (not _let_22)))) (AND_ELIM _let_35 :args (0)) (EQ_RESOLVE (ASSUME :args (_let_4)) (PREPROCESS :args ((= _let_4 _let_18)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (TRUE_INTRO (ASSUME :args (_let_26)))) (CONG (CONG (SYMM (SYMM (ASSUME :args (_let_17)))) (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8)) :args _let_45) (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9)) :args _let_44) (FALSE_INTRO (ASSUME :args _let_43)))) :args (_let_40 _let_17 _let_26))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_40) _let_27))) (REFL :args (_let_28)) (REFL :args ((not _let_26))) :args _let_15)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_42) :args (_let_41))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_41) _let_39))) (REFL :args _let_43) :args _let_15)) _let_42 :args (_let_40 true _let_39)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_38 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_37)) _let_36 :args (_let_26 false _let_29)) :args (_let_28 true _let_27 false _let_26)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_25 :args (k_7 k_6 tptp.lSue_THFTYPE_i QUANTIFIERS_INST_CBQI_PROP)) :args (_let_23))) _let_25 :args (_let_22 false _let_23)) :args (_let_9 false _let_20 false _let_18 true _let_17 false _let_22)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_14) :args (_let_13))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_11))) (REFL :args _let_16) :args _let_15)) _let_14 :args (_let_12 true _let_11)) :args (false false _let_10 false _let_9 true _let_8)) :args (_let_7 (@ (@ tptp.likes_THFTYPE_IiioI tptp.lMary_THFTYPE_i) tptp.lBill_THFTYPE_i) _let_6 _let_5 (@ _let_2 tptp.lBen_THFTYPE_i) (@ _let_3 tptp.lBen_THFTYPE_i) (@ (@ tptp.likes_THFTYPE_IiioI tptp.lBob_THFTYPE_i) tptp.lBill_THFTYPE_i) _let_4 (@ _let_2 tptp.lAnna_THFTYPE_i) _let_1 true)))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.17/0.48  )
% 0.17/0.48  % SZS output end Proof for CSR138^1
% 0.17/0.48  % cvc5---1.0.5 exiting
% 0.17/0.48  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------